Limited Fractional Guard Channel Algorithms : A Learning Automata Approach

نویسندگان

  • HAMID BEIGY
  • M. R. Meybodi
چکیده

In this paper, two learning automata based adaptive limited fractional guard channel algorithms for cellular mobile networks are proposed. These algorithms try to minimize the blocking probability of new calls subject to the constraint on the dropping probability of the handoff calls. To evaluate the proposed algorithms, computer simulation are conducted. The simulation results show that the performance of the proposed algorithms are close to the performance of the limited fractional guard channel algorithm for which prior knowledge about traffic parameters are needed. The simulation results also show that the proposed algorithms outperforms the recently introduced dynamic guard channel algorithms.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Adaptive Uniform Fractional Channel Algorithms

Dropping probability of handoff calls and blocking probability of new calls are two important QoS measures for cellular networks. Since the dropping probability of handoff calls is more important, call admission policies are used to maintain the upper bound of dropping probability of handoff calls. The fractional guard channel policy (FG) is a general call admission policy and includes most pri...

متن کامل

An Adaptive Limited Fractional Guard Channel Policy Using Continuous Action Learning Automata

In this paper, we rst propose a new continuous action learning automaton which uses a stochastic estimator learning algorithm to increase the speed of convergence. Then we introduce an adaptive and autonomous call admission algorithm, which uses the proposed learning automaton. The proposed algorithm minimizes blocking probability of new calls subject to constraint on dropping probability of ha...

متن کامل

Limited Fractional Guard Channel Scheme Using Learning Automata

In this paper, we propose a new continuous action learning automaton and an adaptive and autonomous call admission algorithm, which uses the proposed learning automaton. The proposed algorithm minimizes blocking probability of new calls subject to constraint on dropping probability of handoff calls. The simulation results show that the performance of this algorithm is close to the performance o...

متن کامل

An Adaptive Uniform Fractional Guard Channel Algorithm: A Learning Automata Approach

In [1], a learning automata (LA) based call admission policy is given which accepts new calls as long as the pre-specified level of QoS is maintained. The simulation results show that this policy cannot maintain the upper bound on the level of QoS. In this paper, we propose a new LA based algorithm in which a L-\ is used to accept/reject ne\v calls. This algorithm can be considered as an adapti...

متن کامل

Learning automata based dynamic guard channel algorithms

In this paper, we first propose two learning automata based decentralized dynamic guard channel algorithms for cellular mobile networks. These algorithms use learning automata to adjust the number of guard channels to be assigned to cells of network. Then, we introduce a new model for nonstationary environments under which the proposed algorithms work and study their steady state behavior when ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009